POLYNOMIAL DEHN FUNCTIONS AND THE LENGTH OF ASYNCHRONOUSLY AUTOMATIC STRUCTURES

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms, Dehn Functions, and Automatic Groups

Ever since it was shown in the mid 1980s that being word hyperbolic was equivalent to the existence of a linear time solution to the word problem, computational and algorithmic issues have been intimately intertwined with geometric and topological ones in the study of infinite groups. The scope of this chapter is indicated by the three topics in its title: algorithms, Dehn functions, and automa...

متن کامل

Dehn Filling, Volume, and the Jones Polynomial

Given a hyperbolic 3–manifold with torus boundary, we bound the change in volume under a Dehn filling where all slopes have length at least 2π. This result is applied to give explicit diagrammatic bounds on the volumes of many knots and links, as well as their Dehn fillings and branched covers. Finally, we use this result to bound the volumes of knots in terms of the coefficients of their Jones...

متن کامل

On Dehn Functions of Finitely Presented Bi-Automatic Monoids

For each automatic monoid the word problem can be solved in quadratic time (Campbell et al 1996), and hence, the Dehn function of a nitely presented automatic monoid is recursive. Here we show that this result on the Dehn function cannot be improved in general by presenting nitely presented bi-automatic monoids the Dehn functions of which realize arbitrary complexity classes that are suuciently...

متن کامل

Asynchronously automatic languages and groups

Let A be a finite alphabet and let L ⊂ (A∗)n be an n-variable language over A. We say that L is regular if it is the language accepted by a synchronous n-tape finite state automaton, it is quasi-regular if it is accepted by an asynchronous n-tape automaton, and it is weakly regular if it is accepted by a non-deterministic asynchronous n-tape automaton. We investigate the closure properties of t...

متن کامل

extensions of some polynomial inequalities to the polar derivative

توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the London Mathematical Society

سال: 2002

ISSN: 0024-6115,1460-244X

DOI: 10.1112/s0024611502013564